Some consequences of a Fatou property of the tropical semiring
نویسنده
چکیده
1 Abstract We show that the equatorial semiring Z min = (Zf+1g; min; +) is a Fatou extension of the tropical semiring M = (Nf+1g; min; +). This property allows us to give partial decidability results for the equality problem for rational series with multiplicities in the tropical semiring. We also deduce from it the decidability of the limitedness problem for the equatorial semiring, solving therefore a question of I. Simon. 0 Introduction The tropical semiring is the semiring denoted by M which has support Nf+1g and operations a b = minfa; bg and a b = a + b. It is currently used in the context of cost minimization in operations research. However it appeared that M plays in fact an important role in several problems concerning rational languages (see 8] for a survey of the tropical semiring theory and of its applications). For instance, I. Simon showed that the nite power property for recognizable languages can be reduced to the limitedness problem for the tropical semiring (cf 8]). In the same way, I. Simon used the tropical semiring to study the non-deterministic complexity of a usual nite automaton (cf 9]). An important problem in the tropical semiring theory was to see if it is possible to decide whether two M-rational series are equal or not. We solved recently this question by proving that this equality problem was undecidable (cf 4, 5]). Our proof was strongly based on the introduction of the equatorial semiring Z min which is just the extension of M to arbitrary integers. Indeed it can be shown that the equality problem for Z min is undecidable and that the two above decidability problems are equivalent (cf 4, 5]).
منابع مشابه
Recognizable Sets with Multiplicities in the Tropical Semiring
The last ten years saw the emergence of some results about recognizable subsets of a free monoid with multiplicities in the Min-Plus semiring. An interesting aspect of this theoretical body is that its discovery was motivated throughout by applications such as the nite power property, Eggan's classical star height problem and the measure of the nondeterministic complexity of nite automata. We r...
متن کاملTropical convexity over max-min semiring
This is a survey on an analogue of tropical convexity developed over the max-min semiring, starting with the descriptions of max-min segments, semispaces, hyperplanes and an account of separation and non-separation results based on semispaces. There are some new results. In particular, we give new “colorful” extensions of the max-min Carathéodory theorem. In the end of the paper, we list some c...
متن کاملAn optimal pre-determinization algorithm for weighted transducers
We present a general algorithm, pre-determinization, that makes an arbitrary weighted transducer over the tropical semiring or an arbitrary unambiguous weighted transducer over a cancellative commutative semiring determinizable by inserting in it transitions labeled with special symbols. After determinization, the special symbols can be removed or replaced with -transitions. The resulting trans...
متن کاملA Strong Regular Relation on ?-Semihyperrings
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
متن کاملA disambiguation algorithm for weighted automata
We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness. The algorithm is not applicable to all weighted automata but we prove sufficient conditions for its applicability in the case of the tropical semirin...
متن کامل